Potentially H-bigraphic sequences
نویسندگان
چکیده
منابع مشابه
Potentially H-bigraphic sequences
We extend the notion of a potentially H-graphic sequence as follows. Let A and B be nonnegative integer sequences. The sequence pair S = (A,B) is said to be bigraphic if there is some bipartite graph G = (X ∪ Y, E) such that A and B are the degrees of the vertices in X and Y , respectively. If S is a bigraphic pair, let σ(S) denote the sum of the terms in A. Given a bigraphic pair S, and a fixe...
متن کاملAn Extremal Problem On Potentially Kr+1-H-graphic Sequences
A sequence S is potentially Kp,1,1 graphical if it has a realization containing a Kp,1,1 as a subgraph, where Kp,1,1 is a complete 3-partite graph with partition sizes p, 1, 1. Let σ(Kp,1,1, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(Kp,1,1, n) is potentially Kp,1,1 graphical. In this paper, we prove that σ(Kp,1,1, n) ≥ 2[((p + 1)(n − 1) + 2)/2] ...
متن کاملA General Lower Bound for Potentially H-Graphic Sequences
We consider an extremal problem for graphs as introduced by Erdős, Jacobson and Lehel in [7]. Let π be an n-element graphic sequence. Let H be a graph. We wish to determine the smallest m such that any nterm graphic sequence π whose terms sum to at least m has some realization containing H as a subgraph. Denote this value m by σ(H, n). For an arbitrarily chosen H, we give a construction that yi...
متن کاملOn the Approximate Shape of Degree Sequences That Are Not Potentially H-graphic
A sequence of nonnegative integers π is graphic if it is the degree sequence of some graph G. In this case we say that G is a realization of π, and we write π = π(G). A graphic sequence π is potentially H-graphic if there is a realization of π that contains H as a subgraph. Given nonincreasing graphic sequences π1 = (d1, . . . , dn) and π2 = (s1, . . . , sn), we say that π1 majorizes π2 if di ≥...
متن کاملOn potentially (K4-e)-graphic sequences
In this paper, we characterize the potentially (K4 − e)-graphic sequences where K4 − e is the graph obtained from K4 by removing one edge. This characterization implies a theorem due to C. H. Lai (Australas. J. Combin. 24 (2001), 123–127) and a characterization of potentially C4graphic sequences due to R. Luo (Ars Combin. 64 (2002), 301–318).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2009
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1466